Classification of Average Minimum-B Configurations
نویسندگان
چکیده
منابع مشابه
Minimum Average Cost Clustering
A number of objective functions in clustering problems can be described with submodular functions. In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions. The proposed algorithm does not require the number of clusters in advance, and it will be determined by the ...
متن کاملMinimum Average Distance Triangulations
Some of the following problems look similar to the MAD Triangulation problem, but we have not found any deep connections: •Minimum Average Distance Spanning Subgraph in a budgeted version [2] was studied in the context of network design (minimizing average routing time). The problem is NP-complete even with unit weights. •Minimum Average Distance Spanning Tree [1]. NP-completeness is implied by...
متن کاملOn the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملGenetic algorithms for generating minimum path configurations
Solving a problem on a distributed memory multiprocessor system requires the individual processors to co-operate when necessary, by exchanging messages. These messages are transferred between processors across links which interconnect the processors. If the number of links available at each processor is not restricted then the system may be fully interconnected, having a maximumdistance between...
متن کاملMinimum Average Delay of Routing Trees
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical network represented by a tree T . In the case where the vertices of G are mapped into the leaves of the host tree T the underlying tree is called a routing tree and if the internal vertices of T are forced to have degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kakuyūgō kenkyū
سال: 1969
ISSN: 0451-2375,1884-9571
DOI: 10.1585/jspf1958.22.374